10 research outputs found
Resource dedication problem in a multi-project environment
Resource dedication problem (RDP) in a multi-project environment is defined as the optimal dedication of resource capacities to dierent projects within the overall limits of the resources with the objective of minimizing the sum of the weighted tardinesses of all projects. The projects involved are in general multi-mode resource constrained project scheduling problems (MRCPSP) with nish to start zero time lag and nonpreemtive activities. In general, approaches to multi-project scheduling consider the resources as a pool shared by all projects. When projects are distributed geographically or sharing resources between projects is too costly, then the resource sharing policy may not be appropriate and hence the resources are dedicated to individual projects throughout project durations. To the best of our knowledge, this point of view
for resources is not considered in multi-project literature. In the following, we propose a solution methodology for RDP with a new local improvement heuristic by determining the resource dedications to individual projects and solving scheduling problems with the given resource limits
A modied branch and cut procedure for resource portfolio problem under relaxed resource dedication policy
Multi-project scheduling problems are characterized by the way resources are
managed in the problem environment. The general approach in multi-project
scheduling literature is to consider resource capacities as a common pool that
can be shared among all projects without any restrictions or costs. The way
the resources are used in a multi-project environment is called resource management policy and the aforementioned assumption is called Resource Sharing
Policy in this study. The resource sharing policy is not a generalization
for multi-project scheduling environments and different resource management
policies maybe defined to identify characteristics of different problem environments.
In this study, we present a resource management policy which prevents sharing of resources among projects but allows resource transfers when a project starts after the completion of another one. This policy is called the Relaxed Resource Dedication (RRD) Policy in this study. The general resource capacities might or might not be decision variables. We will treat here the case where the general available amounts of resources are decision variables to be determined subject to a limited budget. We call this problem as the Resource Portfolio Problem (RPP). In this study, RPP is investigated under RRD policy and a modified Branch and Cut (B&C)procedure based on CPLEX is proposed. The B&C procedure of CPLEX is modified with different branching strategies, heuristic solution approaches and valid inequalities. The computational studies presented demonstrate the effectiveness of the proposed solution approaches
A combination of different resource management policies in a multi-project environment
Multi-project problem environments are defined according to the way resources are managed in the problem environment, which is called the resource management policy (RMP) in this study. Different resource management policies can be
defined according to the characteristics of the projects and/or resources in the problem environment. The most common RMP encountered in the multi-project scheduling literature is the resource sharing policy (RSP), where resources can be shared among projects without any costs or limitations. This policy can be seen as an extreme case since there is a strong assumption of unconstrained resource sharing. Another RMP can be defined as the other extreme such that resources cannot be shared among projects, which is called the resource dedication policy (RDP). The last RMP considered in this study is between these two policies where resources are dedicated but can be transferred among projects when a project finishes, the dedicated resources to this project can be transferred to another one starting after the finish of the corresponding project. This RPM is called the resource transfer policy (RTP). In this study we investigate a problem environment where all these three types of RPM are present. Additionally, the general resource capacities are taken as decision variables that are constrained by a given general budget. We call this multi-project environment as the Generalized Resource Portfolio Problem (GRPP). We have investigated this problem and proposed an iterative solution approach based on exact solution methods which determines the general resource capacities from the budget, resource dedications, resource sharing and resource transfer decisions and schedules the individual projects. Computational results
for over forty test problems are reported
Multi-mode resource constrained multi-project scheduling and resource portfolio problem
This paper introduces a multi-project problem environment which involves
multiple projects with assigned due dates; with activities that have alternative
resource usage modes; a resource dedication policy that does not allow
sharing of resources among projects throughout the planning horizon; and a
total budget. There are three issues to face when investigating this multiproject environment. First, the total budget should be distributed among
different resource types to determine the general resource capacities which
correspond to the total amount for each renewable resource to be dedicated
to the projects. With the general resource capacities at hand, the next issue
is to determine the amounts of resources to be dedicated to the individual
projects. With the dedication of resources accomplished, the scheduling
of the projects' activities reduces to the multi-mode resource constrained
project scheduling problem (MRCPSP) for each individual project. Finally
the last issue is the effcient solution of the resulting MRCPSPs. In this paper,
this multi-project environment is modeled in an integrated fashion and designated as the Resource Portfolio Problem. A two-phase and a monolithic
genetic algorithm are proposed as two solution approaches each of which
employs a new improvement move designated as the combinatorial auction
for resource portfolio and the combinatorial auction for resource dedication.
Computational study using test problems demonstrated the effectiveness of
the solution approach proposed
Multi-mode resource constrained multi-project scheduling and resource portfolio problem
This paper introduces a multi-project problem environment which involves
multiple projects with assigned due dates; activities that have alternative resource usage modes; a resource dedication policy that does not allow sharing
of resources among projects throughout the planning horizon; and a total
budget. Three issues arise when investigating this multi-project environment.
First, the total budget should be distributed among different resource
types to determine the general resource capacities, which correspond to the
total amount for each renewable resource to be dedicated to the projects.
With the general resource capacities at hand, the next issue is to determine
the amounts of resources to be dedicated to the individual projects. The
dedication of resources reduces the scheduling of the projects' activities to
a multi-mode resource constrained project scheduling problem (MRCPSP)for each individual project. Finally, the last issue is the ecient solution
of the resulting MRCPSPs. In this paper, this multi-project environment is
modeled in an integrated fashion and designated as the Resource Portfolio
Problem. A two-phase and a monolithic genetic algorithm are proposed as
two solution approaches, each of which employs a new improvement move
designated as the combinatorial auction for resource portfolio and the combinatorial auction for resource dedication. A computational study using test
problems demonstrated the effectiveness of the solution approach proposed.
Keywords: Project scheduling, resource portfolio problem, multi-project
scheduling, resource dedication, resource preference
Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling
The most common approach in the multi-project scheduling literature considers resources as a common pool shared among all projects. However, different resource management strategies may be required for different problem environments. We present the Relaxed Resource Dedication (RRD) policy, which prevents the sharing of resources among projects but allows resource transfers when a project starts after the completion of another one. We treat the case where the available amounts of resources -namely, the capacities- are decision variables subject to a limited budget. This capacity planning problem, called the Resource Portfolio Problem, is investigated under the RRD policy employing both renewable and nonrenewable resources with multiple modes of usage. A mixed integer linear programming model to minimize total weighted tardiness is proposed. To obtain some benchmark solutions for this hard problem, the branch and cut procedure of ILOG CPLEX is modified by customized branching strategies, feasible solution generation schemes and valid inequalities
Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling
The most common approach in the multi-project scheduling literature considers resources as a common pool shared among all projects. However, different resource management strategies may be required for different problem environments. We present the Relaxed Resource Dedication (RRD) policy, which prevents the sharing of resources among projects but allows resource transfers when a project starts after the completion of another one. We treat the case where the available amounts of resources -namely, the capacities- are decision variables subject to a limited budget. This capacity planning problem, called the Resource Portfolio Problem, is investigated under the RRD policy employing both renewable and nonrenewable resources with multiple modes of usage. A mixed integer linear programming model to minimize total weighted tardiness is proposed. To obtain some benchmark solutions for this hard problem, the branch and cut procedure of ILOG CPLEX is modified by customized branching strategies, feasible solution generation schemes and valid inequalities
Resource dedication problem in a multi-project environment
There can be different approaches to the management of resources within
the context of multi-project scheduling problems. In general, approaches to multiproject scheduling problems consider the resources as a pool shared by all projects. On the other hand, when projects are distributed geographically or sharing resources between projects is not preferred, then this resource sharing policy may not be feasible. In such cases, the resources must be dedicated to individual projects throughout the project durations. This multi-project problem environment is defined here as the resource dedication problem (RDP). RDP is defined as the optimal dedication of resource capacities to different projects within the overall limits of the resources and with the objective of minimizing a predetermined objective function. The projects involved are multi-mode resource constrained project scheduling problems with finish to start zero time lag and non-preemptive activities and limited renewable and nonrenewable resources. Here, the characterization of RDP, its mathematical formulation and two different solution methodologies are presented. The first solution approach is a genetic algorithm employing a new improvement move called combinatorial auction for RDP, which is based on preferences of projects for resources. Two different methods for calculating the projects’ preferences based on linear and Lagrangian relaxation are proposed. The second solution approach is a Lagrangian relaxation based heuristic employing subgradient optimization. Numerical studies demonstrate that the proposed approaches are powerful methods for solving this problem
High Conversion Efficiency InP/InGaAs Strained Quantum Well Infrared Photodetector Focal Plane Array With 9.7 mu m Cut-Off for High-Speed Thermal Imaging
InP/InGaAs material system is an alternative to AlGaAs/GaAs for long wavelength quantum well infrared photodetectors (QWIPs). We demonstrate a large format (640 x 512) QWIP focal plane array (FPA) constructed with the strained InP/InGaAs material system. The strain introduced to the structure through utilization of In0.48Ga0.52As (instead of In0.53Ga0.47As) as the quantum well material shifts the cut-off wavelength from similar to 8.5 to 9.7 mu m. The FPA fabricated with the 40-well epilayer structure yields a peak quantum efficiency as high as 12% with a broad spectral response (Delta lambda/lambda(p) = 17%). The peak responsivity of the FPA pixels is 1.4 A/W corresponding to 20% conversion efficiency in the bias region where the detectivity is reasonably high (2.6 x 10(10) cmHz(1/2) /W, f/1.5, 65 K). The FPA providing a background limited performance temperature higher than 65 K (f/1.5) satisfies the requirements of most low integration time/low background applications where AlGaAs/GaAs QWIPs suffer from read-out circuit noise limited sensitivity due to lower conversion efficiencies. Noise equivalent temperature differences of the FPA are as low as 19 and 40 mK with integration times as short as 1.8 ms and 430 mu s (f/1.5, 65 K)